منابع مشابه
Acyclic Models
Acyclic models is a powerful technique in algebraic topology and homological algebra in which facts about homology theories are verified by first verifying them on “models” (on which the homology theory is trivial) and then showing that there are enough models to present arbitrary objects. One version of the theorem allows one to conclude that two chain complex functors are naturally homotopic ...
متن کاملStructuring Acyclic Process Models
This paper addresses the problem of transforming a process model with an arbitrary topology into an equivalent well-structured process model. While this problem has received significant attention, there is still no full characterization of the class of unstructured process models that can be transformed into well-structured ones, nor an automated method to structure any process model that belon...
متن کاملMonoidal Functors, Acyclic Models and Chain Operads
We prove that for a topological operad P the operad of oriented cubical chains, C ∗ (P ), and the operad of singular chains, S∗(P ), are weakly equivalent. As a consequence, C ord ∗ (P ;Q) is formal if and only if S∗(P ;Q) is formal, thus linking together some formality results that are spread out in the literature. The proof is based on an acyclic models theorem for monoidal functors. We give ...
متن کاملMaximal Structuring of Acyclic Process Models
This article addresses the transformation of a process model with an arbitrary topology into an equivalent structured process model. In particular, this article studies the subclass of process models that have no equivalent well-structured representation but which, nevertheless, can be partially structured into their maximally-structured representation. The transformations are performed under a...
متن کاملAcyclic directed graphs representing independence models
In this paper we study the problem of representing probabilistic independence models, in particular those closed under graphoid properties. We focus on acyclic directed graph (DAG): a new algorithm to build a DAG, given an ordering among random variables, is described and peculiarities and advantages of this approach are discussed. Moreover, we provide a necessary and sufficient condition for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1976
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1976-0425947-8